Imprecise covering ring star problem

In this paper, we formulate and solve an Imprecise Covering Ring Star Problem (ICRSP), which is a generalization of the (RSP). Here objective problem to find subset nodes in network minimize sum routing costs interconnecting cycle assignment are out cycle, their nearest concentrators such that no assigned node exceeds predetermined distance (say, covering distance) from concentrators. The distance, as well assignments costs, considered fuzzy proposed ICRSP. A Modified Genetic Algorithm (MGA) developed used model for different confidence levels depending on corresponding imprecise parameters, reducing it deterministic form with possibility necessity approaches. Some comparisons existing benchmark problems made justify performance algorithm. As individual cases, some practical ICRSPs also solved presented numerically.